Power domination in some classes of graphs

نویسنده

  • Seema Varghese
چکیده

The problem of monitoring an electric power system by placing as few phase measurement units (PMUs) in the system as possible is closely related to the well-known domination problem in graphs. The power domination number γp(G) is the minimum cardinality of a power dominating set of G. In this paper, we investigate the power domination problem in Mycielskian and generalized Mycielskian of graphs. We also find the power domination number of direct product of some classes of graphs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

$k$-tuple total restrained domination/domatic in graphs

‎For any integer $kgeq 1$‎, ‎a set $S$ of vertices in a graph $G=(V,E)$ is a $k$-‎tuple total dominating set of $G$ if any vertex‎ ‎of $G$ is adjacent to at least $k$ vertices in $S$‎, ‎and any vertex‎ ‎of $V-S$ is adjacent to at least $k$ vertices in $V-S$‎. ‎The minimum number of vertices of such a set‎ ‎in $G$ we call the $k$-tuple total restrained domination number of $G$‎. ‎The maximum num...

متن کامل

Weak signed Roman domination in graphs

A {em weak signed Roman dominating function} (WSRDF) of a graph $G$ with vertex set $V(G)$ is defined as afunction $f:V(G)rightarrow{-1,1,2}$ having the property that $sum_{xin N[v]}f(x)ge 1$ for each $vin V(G)$, where $N[v]$ is theclosed neighborhood of $v$. The weight of a WSRDF is the sum of its function values over all vertices.The weak signed Roman domination number of $G...

متن کامل

Independent domination in directed graphs

In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...

متن کامل

Weak signed Roman k-domination in graphs

Let $kge 1$ be an integer, and let $G$ be a finite and simple graph with vertex set $V(G)$.A weak signed Roman $k$-dominating function (WSRkDF) on a graph $G$ is a function$f:V(G)rightarrow{-1,1,2}$ satisfying the conditions that $sum_{xin N[v]}f(x)ge k$ for eachvertex $vin V(G)$, where $N[v]$ is the closed neighborhood of $v$. The weight of a WSRkDF $f$ is$w(f)=sum_{vin V(G)}f(v)$. The weak si...

متن کامل

Signed total Italian k-domination in graphs

Let k ≥ 1 be an integer, and let G be a finite and simple graph with vertex set V (G). A signed total Italian k-dominating function (STIkDF) on a graph G is a functionf : V (G) → {−1, 1, 2} satisfying the conditions that $sum_{xin N(v)}f(x)ge k$ for each vertex v ∈ V (G), where N(v) is the neighborhood of $v$, and each vertex u with f(u)=-1 is adjacent to a vertex v with f(v)=2 or to two vertic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011